翻訳と辞書
Words near each other
・ Netroots Nation
・ Netropolitan Club
・ Netropsin
・ Netrostoma
・ Netru Indru
・ Netru Indru Naalai
・ Netru Indru Naalai (1974 film)
・ Netru Indru Naalai (disambiguation)
・ Netru, Indru, Naalai
・ Netrun-mon
・ Netrunner
・ Netrunner (operating system)
・ Netrust
・ NETS
・ Nets Group
Nets Katz
・ Nets of Destiny
・ Nets within Nets
・ Netsafe
・ Netsai Mukomberanwa
・ Netsam
・ Netsanet Achamo
・ Netsanet Gudeta
・ Netscape
・ Netscape (web browser)
・ Netscape 6
・ Netscape 7
・ Netscape Application Server
・ Netscape Browser
・ Netscape Communications Corp. v. Konrad


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Nets Katz : ウィキペディア英語版
Nets Katz
Nets Hawk Katz is professor of mathematics at the California Institute of Technology. He was a professor of mathematics at Indiana University Bloomington until March 2013.
Katz earned a B.A. in mathematics from Rice University in 1990 at the age of 17. He received his Ph.D. in 1993 under Dennis DeTurck at the University of Pennsylvania, with a dissertation titled "Noncommutative Determinants and Applications".〔.〕
He is the author some results in combinatorics (especially additive combinatorics), harmonic analysis and other areas. In 2003, jointly with Jean Bourgain and Terence Tao, he proved that any subset of Z/pZ grows substantially under either addition or multiplication. More precisely, if A is a set such that both A.A and A + A have cardinality at most K|A| then A has size at most K^C or at least p/K^C. This result was followed by the subsequent work of Bourgain, Sergei Konyagin and Glibichuk, establishing that every approximate field is almost a field.
Somewhat earlier he was involved in establishing new bounds in connection with the dimension of Kakeya sets. Jointly with Laba and Tao he proved that the Hausdorff dimension of Kakeya sets in 3 dimensions is strictly greater than 5/2, and jointly with Tao he established new bounds in large dimensions.
In 2010, Nets Katz along with Larry Guth published the results of their collaborative effort to solve the Erdős distinct distances problem, in which they found a "near-optimal" result, proving that a set of points in the plane has at least distinct distances
.
In early 2011, in joint work with Michael Bateman, he improved the best known bounds in the cap set problem: if A is a subset of (Z/3Z)^n of cardinality at least 3^n/n^, where c > 0, then A contains three elements in a line.
In 2012, he was named a Guggenheim fellow.〔(【引用サイトリンク】url=http://www.gf.org/news-events/2012-Fellows-by-field-in-the-United-States-and-Canada/ )〕 During 2011-2012, he was the managing editor of the Indiana University Mathematics Journal.〔(【引用サイトリンク】url=http://www.iumj.indiana.edu/Editorial/editorialb.php )〕〔(【引用サイトリンク】url=http://www.gf.org/fellows/17244-nets-katz )〕 In 2014 he was an invited speaker at the International Congress of Mathematicians at Seoul and gave a talk ''The flecnode polynomial: a central object in incidence geometry''. In 2015 he received the Clay Research Award.〔(Clay Research Award 2015 )〕
==Work==

*
*

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Nets Katz」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.